Signatures and signed switching classes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some minor-closed classes of signed graphs

We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.

متن کامل

Rainbow Graphs and Switching Classes

A rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection between the isomorphism classes of n-rainbow graphs on 2n vertices and the switching classes of graphs on n vertices.

متن کامل

Acyclicity of Switching Classes

For a nite undirected graph G = (V;E) and a subset A V , the vertexswitching of G by A is de ned as the graph G A = (V;E 0 ), which is obtained from G by removing all edges between A and its complement A and adding as edges all nonedges between A and A. A switching class [G] determined by G consists of all vertex-switchings G A for subsets A V . We prove that the trees of a switching class [G] ...

متن کامل

On Perfect Switching Classes

We study a graph transformation (defined by Seidel) called switching which, given a graph G = ( V,E) and a subset W C Jf of its vertices, builds a new graph by exchanging the cocycle linking W to V\ W with its complement. Switching is an equivalence relation and the associated equivalence classes are called switching classes. A switching class is perfect if it contains only perfect graphs. We s...

متن کامل

Pervasive digital signatures: Syntactic robustness and simplicity of signed documents

The action of digitally signing has several intrinsic weaknesses that introduce syntactic and semantic distance between a signer and a relying party. As a result, digitally signed documents cannot be trusted and thus be widely deployed in pervasive environments. We evaluate the syntactic robustness of digitally signed documents by exploiting one key quantitative measure (the structural informat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1986

ISSN: 0095-8956

DOI: 10.1016/0095-8956(86)90088-2